Efficient Earley Parsing with Regular Right-hand Sides
نویسندگان
چکیده
منابع مشابه
Efficient Earley Parsing with Regular Right-hand Sides
We present a new variant of the Earley parsing algorithm capable of efficiently supporting context-free grammars with regular right hand-sides. We present the core state-machine driven algorithm, the translation of grammars into state machines, and the reconstruction algorithm. We also include a theoretical framework for presenting the algorithm and for evaluating optimizations. Finally, we eva...
متن کاملLinear programming with interval right hand sides
In this paper, we study general linear programs in which right handsides are interval numbers. This model is relevant when uncertain and inaccurate factors make di–cult the assignment of a single value to each right handside. When objective function coe–cients are interval numbers in a linear program, it is used to determine optimal solutions according to classical criteria coming from decision...
متن کاملDirectly-Executable Earley Parsing
Deterministic parsing techniques are typically used in favor of general parsing algorithms for efficiency reasons. However, general algorithms such as Earley’s method are more powerful and also easier for developers to use, because no seemingly arbitrary restrictions are placed on the grammar. We describe how to narrow the performance gap between general and deterministic parsers, constructing ...
متن کاملPractical Earley Parsing
Earley’s parsing algorithm is a general algorithm, able to handle any context-free grammar. As with most parsing algorithms, however, the presence of grammar rules having empty right-hand sides complicates matters. By analyzing why Earley’s algorithm struggles with these grammar rules, we have devised a simple solution to the problem. Our empty-rule solution leads to a new type of finite automa...
متن کاملReducing Right-Hand Sides for Termination
We propose two transformations on term rewrite systems (TRSs) based on reducing right hand sides: one related to the transformation order and a variant of dummy elimination. Under mild conditions we prove that the transformed system is terminating if and only if the original one is terminating. Both transformations are very easy to implement, and make it much easier to prove termination of some...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2010
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2010.08.037